Structural complexity theory - PDFSEARCH.IO - Document Search Engine

Structural complexity theory
Results: 144

#	Item
41	Parameterized Algorithms and Circuit Lower Bounds Ryan Williams Stanford Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-02 11:07:07 Complexity classes Mathematical optimization Structural complexity theory Computational resources P versus NP problem NP-complete Circuit complexity P Time hierarchy theorem Theoretical computer science Computational complexity theory Applied mathematics
42	THE COMPLEXITY OF ANALOG COMPUTATION † Anastasios VERGIS Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A. Kenneth STEIGLITZ Department of Computer Science, Princeton University, Pr Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-11-25 03:18:59 Complexity classes Mathematical optimization Structural complexity theory Computability theory P versus NP problem NP-complete NP PP Analog computer Theoretical computer science Computational complexity theory Applied mathematics
43	Words of Wisdom: The Paradox of Our Times Add to Reading List Source URL: www.scborromeo.org Language: English - Date: 2013-02-03 02:46:18 Computational complexity theory Reduction Structural complexity theory
44	Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2010-11-05 18:41:12 Complexity classes Community websites Mathematical optimization Conjectures P versus NP problem Structural complexity theory Stack Exchange Network NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics
45	SOP TRANSACTIONS ON APPLIED MATHEMATICS Accepted version, see http://www.scipublish.com/journals/AM/papers/1097 for published version. Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel Add to Reading List Source URL: drpage.pagewizardgames.com Language: English - Date: 2015-02-07 18:05:03 Mathematical optimization Operations research Complexity classes Structural complexity theory Job shop scheduling NP Algorithm Time complexity Approximation algorithm Theoretical computer science Applied mathematics Computational complexity theory
46	Patch Complexity, Finite Pixel Correlations and Optimal Denoising Anat Levin1 Boaz Nadler1 Fredo Durand2 William T. Freeman2 1 Weizmann Institute Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2012-08-19 10:18:47 Signal processing Image denoising Peak signal-to-noise ratio Structural similarity Noise reduction Lookup table Estimation theory Normal distribution Image processing Statistics Computing
47	COMS11700 Computational complexity Ashley Montanaro Department of Computer Science, University of Bristol Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-05-31 09:18:31 Complexity classes Computational resources Structural complexity theory Analysis of algorithms Time complexity NP Turing machine P Complexity Theoretical computer science Computational complexity theory Applied mathematics
48	Part III Michaelmas 2012 COMPUTATIONAL COMPLEXITY EXERCISE SHEET 1: Turing machines Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2013-10-08 12:31:35 Complexity classes Structural complexity theory Mathematical optimization Analysis of algorithms NP-complete P versus NP problem NP-hard NP Bounded-error probabilistic polynomial Theoretical computer science Computational complexity theory Applied mathematics
49	1 A brief overview of Complexity Theory The following brief overview is intended as a teaser for students in an introductory course on Complexity Theory. Out of the tough came forth sweetness1 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:17 Probabilistic complexity theory Computational complexity theory Mathematical optimization Structural complexity theory NP-complete Complexity NP P versus NP problem Probabilistically checkable proof Theoretical computer science Applied mathematics Complexity classes
50	Structural Complexity And The Acquisition Of Recursive Locative PPs Tyler Peterson (Arizona), Ana Pérez-Leroux (Toronto), Anny Castilla-Earls (SUNY/Fredonia), Susana Béjar, Diane Massam (Toronto) Phase-based models of Add to Reading List Source URL: nels45.mit.edu Language: English - Date: 2014-10-28 01:13:42 Programming idioms Grammar Theoretical computer science Computability theory Theory of computation Recursion Semantics Syntax Preposition and postposition Linguistics Computer programming Mathematics

UPDATE